An Efficient and Highly Available Read-One Write-All Protocol for Replicated Data Management
نویسندگان
چکیده
A new read-one write-all (ROWA) protocol for replicated data is proposed that allows a system to adjust to failures dynamically in order to keep the data available. If failures arrive mostly sequentially, our protocol keeps the data available as long as there is at least one operational replica. This is achieved by making the epoch mechanism, previously applicable to non-ROWA schemes only, usable within the ROWA discipline. Also, adjusting the system to a new conng-uration in our protocol is done completely asynchronously with reads and writes. In contrast, in the existing dynamic schemes (both ROWA and non-ROWA), system reconnguration may interfere with and delay user transactions.
منابع مشابه
An Eecient and Highly Available Read-one Write-all Protocol for Replicated Data Management
A new read-one write-all (ROWA) protocol for replicated data is proposed that allows a system to adjust to failures dynamically in order to keep the data available. If failures arrive mostly sequentially, our protocol keeps the data available as long as there is at least one operational replica. This is achieved by making the epoch mechanism, previously applicable to non-ROWA schemes only, usab...
متن کاملResilient Logical Structures for Efficient Management of Replicated Data
Replicated data management protocols have been pro posed that exploit a logically structured set of copies. These protocols have the advantage that they provide limited fault-tolerance at low communication cost. The propceed protocols can be viewed as analogues of the read-one write-all protocol in the context of logical structures. In this paper, these protocols are generalized in two ways for...
متن کاملTriangular Grid Protocol: An Efficient Scheme for Replica Control with Uniform Access Quorums
Replication is an important technique in distributed database systems. Many recent researches have focused on organizing multiple copies of replicated data into logical structures such as trees and square grids. There has been some progress in getting smaller quorum sizes, higher availability, and better load balancing. These approaches, however, require separate quorums for read and write oper...
متن کاملAn Efficient Optimal Algorithm for Minimizing the Overall Communication Cost in Replicated Data Management
Quorum consensus methods have been widely applied to managing replicated data. In this paper, we study the problem of vote and quorum assignments for minimizing the overall communication cost of processing the typical demands of transactions. This problem is left open, even restricted to a uniform network, and we shall show that it can be solved by an efficient polynomial time algorithm. 1 I n ...
متن کاملProtecting Replicated Objects Against Media Failures
We present a replication control protocol that provides excellent data availabilities while guaranteeing that all writes to the object are recorded in at least two replicas. The protocol, robust dynamic voting (RDV) accepts reads and writes as long as at least two replicas remain available. The replicated object remains inaccessible until either the two last available replicas recover or one of...
متن کامل